An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
نویسندگان
چکیده
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it possible to overcome these restrictions.
منابع مشابه
Extensions of the Knuth-Bendix Ordering with LPO-like Properties
The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition calculi. However, it is incompatible with certain requirements of hierarchic superposition calculi, and it also does not allow non-linear definition equations to be oriented in a natural way. We present two extensions of the Knuth-Bendix ordering that...
متن کاملKBlab: An Equational Theorem Prover for the Macintosh
KBlab is a Completion based theorem prover for equational logic, written in the language C and developed on the Macintosh in the MPW (Macintosh Programmer Workshop) programming environment. The core of KBlab is the Knuth–Bendix Completion Procedure (KB) [9,7,1], extended to Unfailing Knuth– Bendix (UKB) [5], S–strategy [5] and inductive theorem proving (IKB). IKB implements the Huet–Hullot meth...
متن کاملAutomated Termination Analysis for Term Rewriting
variable, 66algebra, 16weakly monotone, 16well-founded, 16argument filtering, 26reverse, 71arity, 10assignment, 16 carrier, 16collapsing, 13compatible, 50constant, 10context, 11closed under, 12cycle, 21 defined symbol, 12dependency graph, 21approximation, 37estimated, 37estimated*, 38dependency pair, 20symbol, 20dom...
متن کاملThe Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to prove the termination of rewriting systems. They are also applied in ordered resolution to prune the search space without compromising refutational completeness. Solving ordering constraints is therefore essential to t...
متن کاملThe Existential Theories of Term Algebras with the Knuth-Bendix Orderings are Decidable
We consider term algebras with simpliication orderings (which are mono-tonic, and well-founded). Solving constraints (quantiier-free formulas) in term algebras with this kind of orderings has several important applications like pruning search space in automated deduction and proving termination and connuence of term rewriting systems. Two kinds of ordering are normally used in automated deducti...
متن کامل